Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:
Traduzione e analisi delle parole da parte dell'intelligenza artificiale
In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:
- come viene usata la parola
- frequenza di utilizzo
- è usato più spesso nel discorso orale o scritto
- opzioni di traduzione delle parole
- esempi di utilizzo (varie frasi con traduzione)
- etimologia
Cosa (chi) è constraint satisfaction - definizione
Constraint satisfaction
PROCESS OF FINDING A SOLUTION TO A SET OF CONSTRAINTS THAT IMPOSE CONDITIONS THAT THE VARIABLES MUST SATISFY
List of constraint satisfaction toolkits
In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution through
constraint satisfaction
PROCESS OF FINDING A SOLUTION TO A SET OF CONSTRAINTS THAT IMPOSE CONDITIONS THAT THE VARIABLES MUST SATISFY
List of constraint satisfaction toolkits
<application> The process of assigning values to variables
while meeting certain requirements or "constraints". For
example, in graph colouring, a node is a variable, the
colour assigned to it is its value and a link between two
nodes represents the constraint that those two nodes must not
be assigned the same colour. In scheduling, constraints
apply to such variables as the starting and ending times for
tasks.
The Simplex method is one well known technique for solving
numerical constraints.
The search difficulty of constraint satisfaction problems can
be determined on average from knowledge of easily computed
structural properties of the problems. In fact, hard
instances of NP-complete problems are concentrated near an
abrupt transition between under- and over-constrained
problems. This transition is analogous to phase transitions
in physical systems and offers a way to estimate the likely
difficulty of a constraint problem before attempting to solve
it with search.
{Phase transitions in search
(ftp://parcftp.xerox.com/pub/dynamics/constraints.html) } (Tad
Hogg, XEROX PARC).
(1995-02-15)
Hierarchical constraint satisfaction
In artificial intelligence and operations research, hierarchical constraint satisfaction (HCS) is a method of handling constraint satisfaction problems where the variables have large domains by exploiting their internal structure.
